On the Idea of Using Granular Rough Mereological Structures in Classification of Data
نویسنده
چکیده
This paper is devoted to an exposition of the idea of using granular structures obtained from data in the classification tasks of these data into decision classes. Classifiers are induced from granular reflections of data sets.
منابع مشابه
A formal approach to Perception Calculus of Zadeh by means of rough mereological logic
Rough set theory is a paradigm for approximate reasoning based on the assumption that concepts are divided into exact and non–exact (called also rough) ones by means of a topological structure induced by a representation of knowledge as a classification. A classification in its most simple form is an equivalence relation on a universe of objects; the classification induces a partition topology ...
متن کاملTOPOLOGICAL SIMILARITY OF L-RELATIONS
$L$-fuzzy rough sets are extensions of the classical rough sets by relaxing theequivalence relations to $L$-relations. The topological structures induced by$L$-fuzzy rough sets have opened up the way for applications of topological factsand methods in granular computing. In this paper, we firstly prove thateach arbitrary $L$-relation can generate an Alexandrov $L$-topology.Based on this fact, w...
متن کاملReasoning about Concepts by Rough Mereological Logics
Rough mereology allows for similarity measures (called rough inclusions) which in turn form a basis for the mechanism of granulation of knowledge. Granules of knowledge, defined as classes of satisfactorily similar objects, can be regarded as worlds in which properties of entities are evaluated. Obtained in this way granular rough mereological intensional logics reveal essential properties of r...
متن کاملTowards Granular Computing: Classifiers Induced From Granular Structures
Granular computing as a paradigm is an area frequently studied within the Approximate Reasoning paradigm. Proposed by L. A.Zadeh granular computing has been studied within fuzzy as well as rough set approaches to uncertainty. It is manifest that both theories are immanently related to granulation as fuzzy set theory begins with fuzzy membership functions whose inverse images are prototype granu...
متن کاملUncertainty analysis of hierarchical granular structures for multi-granulation typical hesitant fuzzy approximation space
Hierarchical structures and uncertainty measures are two main aspects in granular computing, approximate reasoning and cognitive process. Typical hesitant fuzzy sets, as a prime extension of fuzzy sets, are more flexible to reflect the hesitance and ambiguity in knowledge representation and decision making. In this paper, we mainly investigate the hierarchical structures and uncertainty measure...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2008